#include<iostream>
#include<vector>
#include<queue>
#include<cstring>
#include<cmath>
#include<map>
#include<set>
#include<cstdio>
#include<algorithm>
#define debug(a) cout<<#a<<"="<<a<<endl;
using namespace std;
const int maxn=2e5+1000;
typedef long long LL;
inline LL read(){LL x=0,f=1;char ch=getchar();	while (!isdigit(ch)){if (ch=='-') f=-1;ch=getchar();}while (isdigit(ch)){x=x*10+ch-48;ch=getchar();}
return x*f;}
map<LL,LL>map1;
LL ans[maxn];
int main(void){
   	cin.tie(0);std::ios::sync_with_stdio(false);
    LL n;cin>>n;
    for(LL i=1;i<=n;i++){
        LL a,b;cin>>a>>b;
        map1[a]++;map1[a+b]--;
    }
    LL res=0;LL last=0;
    for(auto i:map1){
        ans[res]+=(i.first)-last;
        res+=i.second;
        last=i.first;
    }
    for(LL i=1;i<=n;i++){
        cout<<ans[i]<<" ";
    }cout<<endl;
   	return 0;
}
